The Application of K-Medoids and PAM to the Clustering of Rules
نویسندگان
چکیده
Earlier research has resulted in the production of an ‘allrules’ algorithm for data-mining that produces all conjunctive rules of above given confidence and coverage thresholds. While this is a useful tool, it may produce a large number of rules. This paper describes the application of two clustering algorithms to these rules, in order to identify sets of similar rules and to better understand the data.
منابع مشابه
Partition Around Medoids Clustering on the Intel Xeon Phi Many-Core Coprocessor
The paper touches upon the problem of implementation Partition Around Medoids (PAM) clustering algorithm for the Intel Many Integrated Core architecture. PAM is a form of well-known k-Medoids clustering algorithm and is applied in various subject domains, e.g. bioinformatics, text analysis, intelligent transportation systems, etc. An optimized version of PAM for the Intel Xeon Phi coprocessor i...
متن کاملDeveloping a Course Recommender by Combining Clustering and Fuzzy Association Rules
Each semester, students go through the process of selecting appropriate courses. It is difficult to find information about each course and ultimately make decisions. The objective of this paper is to design a course recommender model which takes student characteristics into account to recommend appropriate courses. The model uses clustering to identify students with similar interests and skills...
متن کاملClustering of Fuzzy Data Sets Based on Particle Swarm Optimization With Fuzzy Cluster Centers
In current study, a particle swarm clustering method is suggested for clustering triangular fuzzy data. This clustering method can find fuzzy cluster centers in the proposed method, where fuzzy cluster centers contain more points from the corresponding cluster, the higher clustering accuracy. Also, triangular fuzzy numbers are utilized to demonstrate uncertain data. To compare triangular fuzzy ...
متن کاملParallel Multi-Swarm PSO Based on K-Medoids and Uniform Design
PAM (Partitioning around Medoid) is introduced to divide the swarm into several different subpopulations. PAM is one of k-medoids clustering algorithms based on partitioning methods. It attempts to divide n objects into k partitions. This algorithm overcomes the drawbacks of being sensitive to the initial partitions in kmeans algorithm. In the parallel PSO algorithms, the swarm needs to be divi...
متن کاملOutlier Detection : A Clustering - Based Approach
16 Abstract— Outlier detection is a fundamental issue in data mining; specifically it has been used to detect and remove anomalous objects from data. It is an extremely important task in a wide variety of application domains. In this paper, a proposed method based on clustering approaches for outlier detection is presented. We first perform the Partitioning Around Medoids (PAM) clustering algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004